The irredundance number and maximum degree of a graphBOLLOBAS, B; COCKAYNE, E. J.Discrete mathematics. 1984, Vol 49, Num 2, pp 197-199, issn 0012-365XArticle

Subdivisions of graphs with large minimum degreeTHOMASSEN, C.Journal of graph theory. 1984, Vol 8, Num 1, pp 23-28, issn 0364-9024Article

Box-threshold graphsPELED, U. N; SIMEONE, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 331-345, issn 0364-9024Article

On the existence of a specified cycle in digraphs with constraints on degreesABDELHAMID BENHOCINE.Journal of graph theory. 1984, Vol 8, Num 1, pp 101-107, issn 0364-9024Article

Monotonicity of the order of (D; g)-cagesBALBUENA, C; MARCOTE, X.Applied mathematics letters. 2011, Vol 24, Num 11, pp 1933-1937, issn 0893-9659, 5 p.Article

Independence, clique size and maximum degreeFAJTLOWICZ, S.Combinatorica (Print). 1984, Vol 4, Num 1, pp 35-38, issn 0209-9683Article

On independent generalized degrees and independence numbers in K(1,m)-free graphsFAUDREE, R. J; GOULD, R. J; JACBSON, M. S et al.Discrete mathematics. 1992, Vol 103, Num 1, pp 17-24, issn 0012-365XArticle

GRAPHS WITH PRESCRIBED SIZE AND VERTEX PARITIES.PRATT PJ; VANDERJAGT DW.1977; COLLOQ. MATH.; POLOGNE; DA. 1977; VOL. 38; NO 1; PP. 147-151; BIBL. 4 REF.Article

A note on class one graphs with maximum degree sixXUECHAO LI; RONG LUO; JIANBING NIU et al.Discrete mathematics. 2006, Vol 306, Num 13, pp 1450-1455, issn 0012-365X, 6 p.Article

The maximum size of graphs satisfying a degree conditionYIPING QIU; XIAO FENG JIA.Discrete mathematics. 1992, Vol 104, Num 2, pp 201-204, issn 0012-365XArticle

THE ORDERS OF GRAPHS WITH PRESCRIBED DEGREE SETSSIPKA TA.1980; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1980; VOL. 4; NO 3; PP. 301-307; BIBL. 2 REF.Article

A matter of degreeCHARTRAND, G; HEVIA, H; OELLERMANN, O et al.SIAM journal on discrete mathematics. 1989, Vol 2, Num 4, pp 456-466, 11 p.Article

(D; N)-CAGESDOWNS MM; GOULD RJ; MITCHEM J et al.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 279-293; BIBL. 5 REF.Conference Paper

DEGREE SETS FOR TRIANGLE-FREE GRAPHSKAPOOR SF; LESNIAK FOSTER L.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 320-330; BIBL. 4 REF.Conference Paper

ON GRAPHS HAVING PRESCRIBED CLIQUE NUMBER, CHROMATIC NUMBER, AND MAXIMUM DEGREE.BENEDICT JM; ZWEIG CHINN P.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 132-140; BIBL. 12 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

POSSIBLE DEGREES OF STRONGLY 2-CONNECTED GRAPHSCHAIKEN S; KLEITMAN DJ; LI SYR et al.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 119-129; BIBL. 10 REF.Article

DEGREE SEQUENCES OF RANDOM GRAPHESBOLLOBAS B.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 1; PP. 1-19; BIBL. 21 REF.Article

MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2ERDOS P; FAJTLOWICZ S; HOFFMAN AJ et al.1980; NETWORKS; USA; DA. 1980; VOL. 10; NO 1; PP. 87-90; BIBL. 4 REF.Article

Non-separating trees in connected graphsDIWAN, Ajit A; THOLIYA, Namrata P.Discrete mathematics. 2009, Vol 309, Num 16, pp 5235-5237, issn 0012-365X, 3 p.Article

On the domination number of Hamiltonian graphs with minimum degree sixXING, Hua-Ming; HATTINGH, Johannes H; PLUMMER, Andrew R et al.Applied mathematics letters. 2008, Vol 21, Num 10, pp 1037-1040, issn 0893-9659, 4 p.Article

On chromatic sums and distributed resource allocationBAR-NOY, A; BELLARE, M; HALLDORSSON, M. M et al.Information and computation (Print). 1998, Vol 140, Num 2, pp 183-202, issn 0890-5401Article

Diameters of cubic graphsJØRGENSEN, L. K.Discrete applied mathematics. 1992, Vol 37-38, pp 347-351, issn 0166-218XArticle

Degree sequences in triangle-free graphsERDÖS, P; FAJTLOWICZ, S; STATON, W et al.Discrete mathematics. 1991, Vol 92, Num 1-3, pp 85-88, issn 0012-365XArticle

Total chromatic number of graphs of high degreeYAP, H. P; WANG JIAN-FANG; ZHANG ZHONGFU et al.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1989, Vol 47, Num 3, pp 445-452, issn 0334-3316, 8 p.Article

Choosability of the square of planar subcubic graphs with large girthHAVET, F.Discrete mathematics. 2009, Vol 309, Num 11, pp 3553-3563, issn 0012-365X, 11 p.Article